Categorical Models for a Semantically Linear Lambda-calculus
نویسندگان
چکیده
منابع مشابه
Categorical Models for a Semantically Linear Lambda-calculus
This paper is about a categorical approach to model a very simple Semantically Linear λcalculus, namedSlλ-calculus. This is a core calculus underlying the programming language SlPCF. In particular, in this work, we introduce the notion of Slλ-Category, which is able to describe a very large class of sound models of Slλ-calculus. Slλ-Category extends in the natural way Benton, Bierman, Hyland an...
متن کاملCategorical Models for a Semantically Linear λ-calculus
This paper is about a categorical approach to model a very simple Semantically Linear λcalculus, namedS λ-calculus. This is a core calculus underlying the programming language S PCF. In particular, in this work, we introduce the notion of S λ-Category, which is able to describe a very large class of sound models of S λ-calculus. S λ-Category extends in the natural way Benton, Bierman, Hyland an...
متن کاملNon-standard Reductions and Categorical Models in Typed Lambda-calculus
We consider the problem of incorporation of new computational rules in lambda calculus with inductive types and recursion. We consider the extensions of standard reduction systems by certain new reductions preserving strong normalization and Church-Rosser property with possible applications to proof assistants and computer algebra systems. Абстракт. Рассматривается проблема добавления новых пра...
متن کاملA Categorical Model for the Lambda Calculus with Constructors
The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching à la ML into a case analysis on constants and a commutation rule between case and application constructs. Although this commutation rule does not match with the usual computing intuitions, it makes the calculus expressive and confluent, with a rather simple...
متن کاملA Categorical Semantics for The Parallel Lambda-Calculus
In this report, we define a sound and complete categorical semantics for the parallel λ-calculus, based on a notion of aggregation monad which is modular w.r.t. associativity, commutativity and idempotence. To prove completeness, we introduce a category of partial equivalence relations adapted to parallelism, in which any extension of the basic equational theory of the calculus is induced by so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2010
ISSN: 2075-2180
DOI: 10.4204/eptcs.22.1